A multiple-choice knapsack based algorithm for CDMA downlink rate differentiation under uplink coverage restrictions

نویسندگان

  • A. Irwan Endrayanto
  • Adriana F. Bumb
  • Richard J. Boucherie
چکیده

This paper presents an analytical model for downlink rate allocation in Code Division Multiple Access (CDMA) mobile networks. By discretizing the coverage area into small segments, the transmit power requirements are characterized via a matrix representation that separates user and system characteristics. We obtain a closed-form analytical expression for the so-called Perron-Frobenius eigenvalue of that matrix, which provides a quick assessment of the feasibility of the power assignment for a given downlink rate allocation. Based on the Perron-Frobenius eigenvalue, we reduce the downlink rate allocation problem to a set of multiple-choice knapsack problems. The solution of these problems provides an approximation of the optimal downlink rate allocation and cell borders for which the system throughput, expressed in terms of downlink rates, is maximized.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Combinatorial Approximation Algorithm for Cdma Downlink Rate Allocation

This paper presents a combinatorial algorithm for downlink rate allocation in Code Division Multiple Access (CDMA) mobile networks. By discretizing the coverage area into small segments, the transmit power requirements are characterized via a matrix representation that separates user and system characteristics. We obtain a closed-form analytical expression for the so-called Perron-Frobenius eig...

متن کامل

An Analytical Model for Cdma Downlink Rate Optimization Taking into Account Uplink Coverage Restriction an Analytical Model for Cdma Downlink Rate Optimization Taking into Account Uplink Coverage Restriction

This paper models and analyzes downlink and uplink power assignment in Code Division Multiple Access (CDMA) mobile networks. By discretizing the area into small segments, the power requirements are characterized via a matrix representation that separates user and system characteristics. We obtain a closed-form analytical expression of the so-called Perron-Frobenius eigenvalue of that matrix, wh...

متن کامل

Downlink Radio Resource Allocation in Cellular CDMA/TDMA Networks: A Novel Heuristic Algorithm

It is shown in [1] that the optimal downlink radio resource allocation for non-realtime traffic in cellular CDMA/TDMA networks can be mapped to a Multi-dimensional Multiple-choice Knapsack Problem (MMKP) which is NP-hard. In this correspondence we propose a heuristic algorithm with polynomial time complexity for this problem. Numerical results indicate significant computational performance impr...

متن کامل

An analytical model for CDMA downlink rate optimization taking into account uplink coverage restrictions

This paper models and analyzes downlink and uplink power assignment in code division multiple access (CDMA) mobile networks. By discretizing the area into small segments, the power requirements are characterized via a matrix representation that separates user and system characteristics. We obtain a closed-form analytical expression of the so-called Perron–Frobenius eigenvalue of that matrix, wh...

متن کامل

MC-CDMA Systems with Uplink and Downlink Receivers over Fading Channels

Bit error rates of uplink and downlink Multicarrier Code Division Multiple Access (MC-CDMA) system using coherent Maximal-Ratio Combing (MRC) and Equal Gain Combining (EGC) receivers are estimated over Rayleigh fading channels. The analysis assumes that different subcarriers experience independent fading channels, but not necessary identically distributed. The analysis is based on Gaussian appr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004